An algorithm for detecting Directional Quasi–Convexity

نویسندگان

  • Holger Dullin
  • Francesco Fassò
چکیده

Directional Quasi–Convexity (DQC) is a sufficient condition for Nekhoroshev stability, that is, stability for finite but very long times, of elliptic equilibria of Hamiltonian systems. The numerical detection of DQC is elementary for system with three degrees of freedom. In this article, we propose a recursive algorithm to test DQC in any number n ≥ 4 of degrees of freedom.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...

متن کامل

Optimization of Dogleg Severity in Directional Drilling Oil Wells Using Particle Swarm Algorithm (Short Communication)

The dogleg severity is one of the most important parameters in directional drilling. Improvement of these indicators actually means choosing the best conditions for the directional drilling in order to reach the target point. Selection of high levels of the dogleg severity actually means minimizing well trajectory, but on the other hand, increases fatigue in drill string, increases torque and d...

متن کامل

A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) –HLCP over symmetric cones using exponential convexity

In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...

متن کامل

Conditioning , halting criteria and choosing λ

We show the convergence of 1+λ-ES with standard step-size update-rules on a large family of fitness functions without any convexity assumption or quasi-convexity assumptions ([3, 6]). The result provides a rule for choosing λ and shows the consistency of halting criteria based on thresholds on the step-size. The family of functions under work is defined through a conditionnumber that generalize...

متن کامل

Using BELBIC based optimal controller for omni-directional threewheel robots model identified by LOLIMOT

In this paper, an intelligent controller is applied to control omni-directional robots motion. First, the dynamics of the three wheel robots, as a nonlinear plant with considerable uncertainties, is identified using an efficient algorithm of training, named LoLiMoT. Then, an intelligent controller based on brain emotional learning algorithm is applied to the identified model. This emotional l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002